p-bits for probabilistic spin logic
نویسندگان
چکیده
منابع مشابه
Weighted p-bits for FPGA implementation of probabilistic circuits
Probabilistic spin logic (PSL) is a recently proposed computing paradigm based on unstable stochastic units called probabilistic bits (p-bits) that can be correlated to form probabilistic circuits (p-circuits). These p-circuits can be used to solve problems of optimization, inference and also to implement precise Boolean functions in an “inverted” mode, where a given Boolean circuit can operate...
متن کاملP-CLASSIC: A tractable probabilistic description logic
Knowledge representation languages invariably reflect a trade-off between expressivity and tractability. Evidence suggests that the compromise chosen by description logics is a particularly successful one. However, description logic (as for all variants of first-order logic) is severely limited in its ability to express uncertainty. In this paper, we present P-CLASSIC, a probabilistic version o...
متن کاملProbabilistic logic under coherence, model-theoretic probabilistic logic, and default reasoning in System P
We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to modeltheoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabili...
متن کاملPushing Bits Through a Spin Wire
In the quest to use spin for quantum communication, researchers are constantly looking for new types of magnetic phases. A promising route for this control in solids is to exploit vector spin chirality. This is a pseudovector quantity formed by two neighboring atoms’ electronic spins that breaks parity and mirror symmetries. It is usually present together with cycloidal magnetism, but can be ex...
متن کاملNon-planar spin bits beyond two loops
We study higher-loop orders of spin bit models underlying the nonplanar dynamics of N = 4 SYM gauge theory. In particular, we derive a ”tower” of non-planar identities involving products of site permutation operators. Such identities are then applied in the formulation of planarly consistent, testable conjectures for the full non-planar, higher-loop Hamiltonian of the su(2) spin-chain.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Physics Reviews
سال: 2019
ISSN: 1931-9401
DOI: 10.1063/1.5055860